Search results for "bound-variable anaphora"

showing 1 items of 1 documents

Semantic Complexity in Natural Language

2015

This chapter presents the technical framework that the authors used to define fragments of natural languages and formulate questions as to their semantic complexity. It examines the study of the classical syllogistic and its extensions. It analyzes the semantic complexity of various salient fragments of English. It highlights that the language of argument, featuring transitive verbs, is in an objective sense inferentially no more complex than the language of classical syllogisms exemplified by argument, indeed, the analogous extension featuring ditransitive verbs involves only a modest increase in complexity. On the other hand, the language of argument, which adds relative clauses to the cl…

numerical determinerssemantic complexitybound-variable anaphoranoun-level negationfragments of languagerelative clausessyllogistic proof systemnatural language
researchProduct